Finitely generated groups (mod $p$)

Finitely Generated Abelian Groups

Finitely Generated Semiautomatic Groups

The present work shows that Cayley automatic groups are semiautomatic and exhibits some further constructions of semiautomatic groups and in particular shows that every finitely generated group of nilpotency class 3 is semiautomatic.

On the verbal width of finitely generated pro-p groups

Let p be a prime. It is proved that a non-trivial word w from a free group F has finite width in every finitely generated pro-p group if and only if w 6∈ (F ′)pF ′′. Also it is shown that any word w has finite width in a compact p-adic group.

Powers in Finitely Generated Groups

In this paper we study the set Γn of nth-powers in certain finitely generated groups Γ. We show that, if Γ is soluble or linear, and Γn contains a finite index subgroup, then Γ is nilpotent-by-finite. We also show that, if Γ is linear and Γn has finite index (i.e. Γ may be covered by finitely many translations of Γn), then Γ is soluble-by-finite. The proof applies invariant measures on amenable...

Combinatorics of Finitely Generated Groups

of the Dissertation Combinatorics of Finitely Generated Groups